منابع مشابه
Generalized Quantum Arthur-Merlin Games
This paper investigates the role of interaction and coins in public-coin quantum interactive proof systems (also called quantum Arthur-Merlin games). While prior works focused on classical public coins even in the quantum setting, the present work introduces a generalized version of quantum Arthur-Merlin games where the public coins can be quantum as well: the verifier can send not only random ...
متن کاملQuantum Merlin Arthur with Exponentially Small Gap
We will study the complexity of QMA proof systems with inverse exponentially small promise gap. We will show that this class, QMAexp, can be exactly characterized by PSPACE, the class of problems solvable with a polynomial amount of memory. As applications we show that a “precise” version of the Local Hamiltonian problem is PSPACE-complete, and give a provable setting in which the ability to pr...
متن کاملQuantum Merlin-Arthur with noisy channel
What happens if in QMA the quantum channel between Merlin and Arthur is noisy? It is not difficult to show that such a modification does not change the computational power as long as the noise is not too strong so that errors are correctable with high probability, since if Merlin encodes the witness state in a quantum error-correction code and sends it to Arthur, Arthur can correct the error ca...
متن کاملQuantum Arthur-Merlin with single-qubit measurements
Tomoyuki Morimae ∗ ASRLD Unit, Gunma University, 1-5-1 Tenjin-cho Kiryu-shi Gunma-ken, 376-0052, Japan Abstract We show that the class QAM does not change even if the verifier’s ability is restricted to only single-qubit measurements. To show the result, we use the idea of the measurement-based quantum computing: the verifier, who can do only single-qubit measurements, can test the graph state ...
متن کاملLecture 24 : QMA : Quantum Merlin - Arthur
Given a string x and a decision problem L, there is an omniscient prover who sends a string π ∈ {0, 1} to a polytime deterministic algorithm called a verifier V , and V (x, π) runs in polynomial time and returns 1 if x is a YES-instance and 0 if x is a NO-instance. The verifier must satisfy the properties of soundness and completeness: in particular, if x is a YES-instance of L, then there exis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information and Computation
سال: 2015
ISSN: 1533-7146,1533-7146
DOI: 10.26421/qic15.15-16-10